MATHEMATICAL MODELLING AND SIMULATION OF FINGERPRINT ANALYSIS USING GRAPH ISOMORPHISM, DOMINATION, AND GRAPH PEBBLING
نویسندگان
چکیده
In this work, an attempt has been made to represent and simulate fingerprint pattern analysis mathematically using graph isomorphism, dominance pebbling. The idea of categorizing by locating the ridge characteristics attempted be implemented in work. An image is used as input for mathematical modelling simulation. For simulation a fingerprint, we define two techniques. first technique, Algorithm finding graphical representation second $A_2$ determining whether graphs any patterns are isomorphic or not. objective study identify that fingerprints similar different with help domination Our goal improve identification accuracy various orientations. Received: March 22, 2023Accepted: May 16, 2023
منابع مشابه
Domination Cover Pebbling: Graph Families
Given a configuration of pebbles on the vertices of a connected graph G, a pebbling move is defined as the removal of two pebbles from some vertex, and the placement of one of these on an adjacent vertex. We introduce the notion of domination cover pebbling, obtained by combining graph cover pebbling ([2]) with the theory of domination in graphs ([3]). The domination cover pebbling number, ψ(G)...
متن کاملOn exponential domination and graph operations
An exponential dominating set of graph $G = (V,E )$ is a subset $Ssubseteq V(G)$ such that $sum_{uin S}(1/2)^{overline{d}{(u,v)-1}}geq 1$ for every vertex $v$ in $V(G)-S$, where $overline{d}(u,v)$ is the distance between vertices $u in S$ and $v in V(G)-S$ in the graph $G -(S-{u})$. The exponential domination number, $gamma_{e}(G)$, is the smallest cardinality of an exponential dominating set....
متن کاملGraph Invariants and Graph Isomorphism
In graph theory, Graph Isomorphism is an important issue. Information in the database can be stored in the form of graph. Graph represents the structural information in an efficient way. Graph Isomorphism problem is to determine if there exists one to one correspondence between the structures of two graphs. Graph isomorphism problem arises in many fields such as chemistry, switching theory, inf...
متن کاملGraph Rubbling: an Extension of Graph Pebbling
Graph Rubbling: An Extension of Graph Pebbling Christopher Andrew Belford Place a whole number of pebbles on the vertices of a simple, connected graph G; this is called a pebble distribution. A rubbling move consists of removing a total of two pebbles from some neighbor(s) of a vertex v of G and placing a single pebble on v. A vertex v of G is called reachable from an initial pebble distributio...
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances and applications in discrete mathematics
سال: 2023
ISSN: ['0974-1658']
DOI: https://doi.org/10.17654/0974165823052